The Microcosm Principle and Concurrency in Coalgebra
نویسندگان
چکیده
Coalgebras are categorical presentations of state-based systems. In investigating parallel composition of coalgebras (realizing concurrency), we observe that the same algebraic theory is interpreted in two different domains in a nested manner, namely: in the category of coalgebras, and in the final coalgebra as an object in it. This phenomenon is what Baez and Dolan have called the microcosm principle, a prototypical example of which is “a monoid in a monoidal category.” In this paper we obtain a formalization of the microcosm principle in which such a nested model is expressed categorically as a suitable lax natural transformation. An application of this account is a general compositionality result which supports modular verification of complex systems.
منابع مشابه
The Microcosm Principle and Compositionality of GSOS-Based Component Calculi
In the previous work by Jacobs, Sokolova and the author, synchronous parallel composition of coalgebras—yielding a coalgebra—and parallel composition of behaviors—yielding a behavior, where behaviors are identified with states of the final coalgebra—were observed to form an instance of the microcosm principle. The microcosm principle, a term by Baez and Dolan, refers to the general phenomenon o...
متن کاملCoalgebra, Concurrency, and Control
Coalgebra is used to generalize notions and techniques from concurrency theory, in order to apply them to problems concerning the supervisory control of discrete event systems. The main ingredients of this approach are the characterization of controllability in terms of (a variant of) the notion of bisimulation, and the observation that the family of (partial) languages carries a final coalgebr...
متن کاملA Coinduction Principle for Recursive Data Types Based on Bisimulation
Synopsis The concept of bisimulation from concurrency theory Par81, Mil89] is used to reason about recursively deened data types. From two strong-extensionality theorems stating that the equality (resp. inequality) relation is maximal among all bisimulations, a proof principle for the nal coalgebra of an endofunctor on a category of data types (resp. domains) is obtained. As an application of t...
متن کاملCentrum Voor Wiskunde En Informatica Coalgebra, Concurrency, and Control
Coalgebra is used to generalize notions and techniques from concurrency theory, in order to apply them to problems concerning the supervisory control of discrete event systems. The main ingredients of this approach are the characterization of controllability in terms of (a variant of) the notion of bisimulation, and the observation that the family of (partial) languages carries a final coalgebr...
متن کامل